Efficient Methodologies to Handle Hanging Pages Using Virtual Node
نویسندگان
چکیده
In this paper we first explain the Knowledge Extraction (KE) process from World Wide Web (WWW) using Search engines. Then we explore the PageRank algorithm of Google Search engine (one of the famous link based search engine) with its hidden Markov analysis. In that we also explore one of the problems of Link based ranking algorithms called hanging pages or dangling pages (pages without any forward links). The presence of these pages affects the ranking of Web pages. Some of the hanging pages may contain important information which cannot be neglected by the search engines during ranking. We proposed methodologies to handle the hanging pages and compare the methodologies. We also introduce TrustRank algorithm (an algorithm to handle the spamming problems in link based search engines) and included it in our proposed methods so that our methods combat Web spam. We implemented PageRank algorithm and TrustRank algorithm and modified those algorithms to implement our proposed methodologies.
منابع مشابه
Adaptive Bem-based Fem on Polygonal Meshes from Virtual Element Methods
Polygonal meshes are especially suited for the discretization of boundary value problems in adaptive mesh refinement strategies. Such meshes are very flexible and incorporate hanging nodes naturally. But only a few approaches are available that handle polygonal discretizations in this context. The BEM-based Finite Element Method (FEM) and a residual based error estimate are reviewed in the pres...
متن کاملApplication of Markov Chain in the PageRank Algorithm
Link analysis algorithms for Web search engines determine the importance and relevance of Web pages. Among the link analysis algorithms, PageRank is the state of the art ranking mechanism that is used in Google search engine today. The PageRank algorithm is modeled as the behavior of a randomized Web surfer; this model can be seen as Markov chain to predict the behavior of a system that travels...
متن کاملIntrathoracic Airway Tree Segmentation from CT Images Using a Fuzzy Connectivity Method
Introduction: Virtual bronchoscopy is a reliable and efficient diagnostic method for primary symptoms of lung cancer. The segmentation of airways from CT images is a critical step for numerous virtual bronchoscopy applications. Materials and Methods: To overcome the limitations of the fuzzy connectedness method, the proposed technique, called fuzzy connectivity - fuzzy C-mean (FC-FCM), utilized...
متن کاملTarget Tracking Based on Virtual Grid in Wireless Sensor Networks
One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...
متن کاملRanking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Cybernetics and Systems
دوره 42 شماره
صفحات -
تاریخ انتشار 2011